<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.13"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>OpenMesh: OpenMesh/Core/Mesh/ArrayKernelT_impl.hh Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript">
  $(document).ready(initResizable);
</script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
<link href="logo_align.css" rel="stylesheet" type="text/css"/>
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td id="projectlogo"><img alt="Logo" src="rwth_vci_rgb.jpg"/></td>
  <td id="projectalign" style="padding-left: 0.5em;">
   <div id="projectname">OpenMesh
   </div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.13 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
<script type="text/javascript" src="menudata.js"></script>
<script type="text/javascript" src="menu.js"></script>
<script type="text/javascript">
$(function() {
  initMenu('',true,false,'search.php','Search');
  $(document).ready(function() { init_search(); });
});
</script>
<div id="main-nav"></div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
  <div id="nav-tree">
    <div id="nav-tree-contents">
      <div id="nav-sync" class="sync"></div>
    </div>
  </div>
  <div id="splitbar" style="-moz-user-select:none;" 
       class="ui-resizable-handle">
  </div>
</div>
<script type="text/javascript">
$(document).ready(function(){initNavTree('a00323_source.html','');});
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0" 
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>

<div class="header">
  <div class="headertitle">
<div class="title">ArrayKernelT_impl.hh</div>  </div>
</div><!--header-->
<div class="contents">
<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">/* ========================================================================= *</span></div><div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160;<span class="comment"> *                                                                           *</span></div><div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;<span class="comment"> *                               OpenMesh                                    *</span></div><div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="comment"> *           Copyright (c) 2001-2015, RWTH-Aachen University                 *</span></div><div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="comment"> *           Department of Computer Graphics and Multimedia                  *</span></div><div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;<span class="comment"> *                          All rights reserved.                             *</span></div><div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;<span class="comment"> *                            www.openmesh.org                               *</span></div><div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;<span class="comment"> *                                                                           *</span></div><div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;<span class="comment"> *---------------------------------------------------------------------------*</span></div><div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;<span class="comment"> * This file is part of OpenMesh.                                            *</span></div><div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;<span class="comment"> *---------------------------------------------------------------------------*</span></div><div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;<span class="comment"> *                                                                           *</span></div><div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;<span class="comment"> * Redistribution and use in source and binary forms, with or without        *</span></div><div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;<span class="comment"> * modification, are permitted provided that the following conditions        *</span></div><div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;<span class="comment"> * are met:                                                                  *</span></div><div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;<span class="comment"> *                                                                           *</span></div><div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;<span class="comment"> * 1. Redistributions of source code must retain the above copyright notice, *</span></div><div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;<span class="comment"> *    this list of conditions and the following disclaimer.                  *</span></div><div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;<span class="comment"> *                                                                           *</span></div><div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;<span class="comment"> * 2. Redistributions in binary form must reproduce the above copyright      *</span></div><div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;<span class="comment"> *    notice, this list of conditions and the following disclaimer in the    *</span></div><div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;<span class="comment"> *    documentation and/or other materials provided with the distribution.   *</span></div><div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;<span class="comment"> *                                                                           *</span></div><div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;<span class="comment"> * 3. Neither the name of the copyright holder nor the names of its          *</span></div><div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;<span class="comment"> *    contributors may be used to endorse or promote products derived from   *</span></div><div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;<span class="comment"> *    this software without specific prior written permission.               *</span></div><div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160;<span class="comment"> *                                                                           *</span></div><div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160;<span class="comment"> * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS       *</span></div><div class="line"><a name="l00029"></a><span class="lineno">   29</span>&#160;<span class="comment"> * &quot;AS IS&quot; AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED *</span></div><div class="line"><a name="l00030"></a><span class="lineno">   30</span>&#160;<span class="comment"> * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A           *</span></div><div class="line"><a name="l00031"></a><span class="lineno">   31</span>&#160;<span class="comment"> * PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER *</span></div><div class="line"><a name="l00032"></a><span class="lineno">   32</span>&#160;<span class="comment"> * OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,  *</span></div><div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;<span class="comment"> * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,       *</span></div><div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;<span class="comment"> * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR        *</span></div><div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;<span class="comment"> * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF    *</span></div><div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160;<span class="comment"> * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING      *</span></div><div class="line"><a name="l00037"></a><span class="lineno">   37</span>&#160;<span class="comment"> * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS        *</span></div><div class="line"><a name="l00038"></a><span class="lineno">   38</span>&#160;<span class="comment"> * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.              *</span></div><div class="line"><a name="l00039"></a><span class="lineno">   39</span>&#160;<span class="comment"> *                                                                           *</span></div><div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;<span class="comment"> * ========================================================================= */</span></div><div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;</div><div class="line"><a name="l00042"></a><span class="lineno">   42</span>&#160;<span class="preprocessor">#define OPENMESH_ARRAY_KERNEL_C</span></div><div class="line"><a name="l00043"></a><span class="lineno">   43</span>&#160;</div><div class="line"><a name="l00044"></a><span class="lineno">   44</span>&#160;<span class="comment">//== INCLUDES =================================================================</span></div><div class="line"><a name="l00045"></a><span class="lineno">   45</span>&#160;</div><div class="line"><a name="l00046"></a><span class="lineno">   46</span>&#160;<span class="preprocessor">#include &lt;OpenMesh/Core/Mesh/ArrayKernel.hh&gt;</span></div><div class="line"><a name="l00047"></a><span class="lineno">   47</span>&#160;</div><div class="line"><a name="l00048"></a><span class="lineno">   48</span>&#160;<span class="comment">//== NAMESPACES ===============================================================</span></div><div class="line"><a name="l00049"></a><span class="lineno">   49</span>&#160;</div><div class="line"><a name="l00050"></a><span class="lineno">   50</span>&#160;<span class="keyword">namespace </span><a class="code" href="a01233.html">OpenMesh</a></div><div class="line"><a name="l00051"></a><span class="lineno">   51</span>&#160;{</div><div class="line"><a name="l00052"></a><span class="lineno">   52</span>&#160;</div><div class="line"><a name="l00053"></a><span class="lineno">   53</span>&#160;<span class="comment">//== IMPLEMENTATION ==========================================================</span></div><div class="line"><a name="l00054"></a><span class="lineno">   54</span>&#160;</div><div class="line"><a name="l00055"></a><span class="lineno">   55</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> std_API_Container_VHandlePointer,</div><div class="line"><a name="l00056"></a><span class="lineno">   56</span>&#160;         <span class="keyword">typename</span> std_API_Container_HHandlePointer,</div><div class="line"><a name="l00057"></a><span class="lineno">   57</span>&#160;         <span class="keyword">typename</span> std_API_Container_FHandlePointer&gt;</div><div class="line"><a name="l00058"></a><span class="lineno"><a class="line" href="a02113.html#aa050099ff46a17b4f38594eba0aefce2">   58</a></span>&#160;<span class="keywordtype">void</span> <a class="code" href="a02113.html#aba7fd4df59227f974b44111ac45e835f">ArrayKernel::garbage_collection</a>(std_API_Container_VHandlePointer&amp; vh_to_update,</div><div class="line"><a name="l00059"></a><span class="lineno">   59</span>&#160;                                     std_API_Container_HHandlePointer&amp; hh_to_update,</div><div class="line"><a name="l00060"></a><span class="lineno">   60</span>&#160;                                     std_API_Container_FHandlePointer&amp; fh_to_update,</div><div class="line"><a name="l00061"></a><span class="lineno">   61</span>&#160;                                     <span class="keywordtype">bool</span> _v, <span class="keywordtype">bool</span> _e, <span class="keywordtype">bool</span> _f)</div><div class="line"><a name="l00062"></a><span class="lineno">   62</span>&#160;{</div><div class="line"><a name="l00063"></a><span class="lineno">   63</span>&#160;</div><div class="line"><a name="l00064"></a><span class="lineno">   64</span>&#160;<span class="preprocessor">#ifdef DEBUG</span></div><div class="line"><a name="l00065"></a><span class="lineno">   65</span>&#160;<span class="preprocessor">  #ifndef OM_GARBAGE_NO_STATUS_WARNING</span></div><div class="line"><a name="l00066"></a><span class="lineno">   66</span>&#160;    <span class="keywordflow">if</span> ( !this-&gt;has_vertex_status() )</div><div class="line"><a name="l00067"></a><span class="lineno">   67</span>&#160;      omerr() &lt;&lt; <span class="stringliteral">&quot;garbage_collection: No vertex status available. You can request it: mesh.request_vertex_status() or define OM_GARBAGE_NO_STATUS_WARNING to silence this warning.&quot;</span> &lt;&lt; std::endl;</div><div class="line"><a name="l00068"></a><span class="lineno">   68</span>&#160;    <span class="keywordflow">if</span> ( !this-&gt;has_edge_status() )</div><div class="line"><a name="l00069"></a><span class="lineno">   69</span>&#160;      omerr() &lt;&lt; <span class="stringliteral">&quot;garbage_collection: No edge status available. You can request it: mesh.request_edge_status() or define OM_GARBAGE_NO_STATUS_WARNING to silence this warning.&quot;</span> &lt;&lt; std::endl;</div><div class="line"><a name="l00070"></a><span class="lineno">   70</span>&#160;    <span class="keywordflow">if</span> ( !this-&gt;has_face_status() )</div><div class="line"><a name="l00071"></a><span class="lineno">   71</span>&#160;      omerr() &lt;&lt; <span class="stringliteral">&quot;garbage_collection: No face status available. You can request it: mesh.request_face_status() or define OM_GARBAGE_NO_STATUS_WARNING to silence this warning.&quot;</span> &lt;&lt; std::endl;</div><div class="line"><a name="l00072"></a><span class="lineno">   72</span>&#160;<span class="preprocessor">  #endif</span></div><div class="line"><a name="l00073"></a><span class="lineno">   73</span>&#160;<span class="preprocessor">#endif</span></div><div class="line"><a name="l00074"></a><span class="lineno">   74</span>&#160;</div><div class="line"><a name="l00075"></a><span class="lineno">   75</span>&#160;  <span class="keyword">const</span> <span class="keywordtype">bool</span> track_vhandles = ( !vh_to_update.empty() );</div><div class="line"><a name="l00076"></a><span class="lineno">   76</span>&#160;  <span class="keyword">const</span> <span class="keywordtype">bool</span> track_hhandles = ( !hh_to_update.empty() );</div><div class="line"><a name="l00077"></a><span class="lineno">   77</span>&#160;  <span class="keyword">const</span> <span class="keywordtype">bool</span> track_fhandles = ( !fh_to_update.empty() );</div><div class="line"><a name="l00078"></a><span class="lineno">   78</span>&#160;</div><div class="line"><a name="l00079"></a><span class="lineno">   79</span>&#160;  <span class="keywordtype">int</span> i, i0, i1;</div><div class="line"><a name="l00080"></a><span class="lineno">   80</span>&#160;</div><div class="line"><a name="l00081"></a><span class="lineno">   81</span>&#160;  <span class="keywordtype">int</span> nV = int(n_vertices());</div><div class="line"><a name="l00082"></a><span class="lineno">   82</span>&#160;  <span class="keywordtype">int</span> nE = int(n_edges());</div><div class="line"><a name="l00083"></a><span class="lineno">   83</span>&#160;  <span class="keywordtype">int</span> nH = int(2*n_edges());</div><div class="line"><a name="l00084"></a><span class="lineno">   84</span>&#160;  <span class="keywordtype">int</span> nF = (int(n_faces()));</div><div class="line"><a name="l00085"></a><span class="lineno">   85</span>&#160;</div><div class="line"><a name="l00086"></a><span class="lineno">   86</span>&#160;  std::vector&lt;VertexHandle&gt;    vh_map;</div><div class="line"><a name="l00087"></a><span class="lineno">   87</span>&#160;  std::vector&lt;HalfedgeHandle&gt;  hh_map;</div><div class="line"><a name="l00088"></a><span class="lineno">   88</span>&#160;  std::vector&lt;FaceHandle&gt;      fh_map;</div><div class="line"><a name="l00089"></a><span class="lineno">   89</span>&#160;</div><div class="line"><a name="l00090"></a><span class="lineno">   90</span>&#160;  std::map &lt;int, int&gt; vertex_inverse_map;</div><div class="line"><a name="l00091"></a><span class="lineno">   91</span>&#160;  std::map &lt;int, int&gt; halfedge_inverse_map;</div><div class="line"><a name="l00092"></a><span class="lineno">   92</span>&#160;  std::map &lt;int, int&gt; face_inverse_map;</div><div class="line"><a name="l00093"></a><span class="lineno">   93</span>&#160;</div><div class="line"><a name="l00094"></a><span class="lineno">   94</span>&#160;  <span class="comment">// setup handle mapping:</span></div><div class="line"><a name="l00095"></a><span class="lineno">   95</span>&#160;  vh_map.reserve(nV);</div><div class="line"><a name="l00096"></a><span class="lineno">   96</span>&#160;  <span class="keywordflow">for</span> (i=0; i&lt;nV; ++i) vh_map.push_back(<a class="code" href="a02241.html">VertexHandle</a>(i));</div><div class="line"><a name="l00097"></a><span class="lineno">   97</span>&#160;</div><div class="line"><a name="l00098"></a><span class="lineno">   98</span>&#160;  hh_map.reserve(nH);</div><div class="line"><a name="l00099"></a><span class="lineno">   99</span>&#160;  <span class="keywordflow">for</span> (i=0; i&lt;nH; ++i) hh_map.push_back(<a class="code" href="a02245.html">HalfedgeHandle</a>(i));</div><div class="line"><a name="l00100"></a><span class="lineno">  100</span>&#160;</div><div class="line"><a name="l00101"></a><span class="lineno">  101</span>&#160;  fh_map.reserve(nF);</div><div class="line"><a name="l00102"></a><span class="lineno">  102</span>&#160;  <span class="keywordflow">for</span> (i=0; i&lt;nF; ++i) fh_map.push_back(<a class="code" href="a02253.html">FaceHandle</a>(i));</div><div class="line"><a name="l00103"></a><span class="lineno">  103</span>&#160;</div><div class="line"><a name="l00104"></a><span class="lineno">  104</span>&#160;  <span class="comment">// remove deleted vertices</span></div><div class="line"><a name="l00105"></a><span class="lineno">  105</span>&#160;  <span class="keywordflow">if</span> (_v &amp;&amp; n_vertices() &gt; 0 &amp;&amp; this-&gt;has_vertex_status() )</div><div class="line"><a name="l00106"></a><span class="lineno">  106</span>&#160;  {</div><div class="line"><a name="l00107"></a><span class="lineno">  107</span>&#160;    i0=0;  i1=nV-1;</div><div class="line"><a name="l00108"></a><span class="lineno">  108</span>&#160;</div><div class="line"><a name="l00109"></a><span class="lineno">  109</span>&#160;    <span class="keywordflow">while</span> (1)</div><div class="line"><a name="l00110"></a><span class="lineno">  110</span>&#160;    {</div><div class="line"><a name="l00111"></a><span class="lineno">  111</span>&#160;      <span class="comment">// find 1st deleted and last un-deleted</span></div><div class="line"><a name="l00112"></a><span class="lineno">  112</span>&#160;      <span class="keywordflow">while</span> (!<a class="code" href="a02113.html#a8898075831dccdbc4a2dd72472f0e8e3">status</a>(<a class="code" href="a02241.html">VertexHandle</a>(i0)).deleted() &amp;&amp; i0 &lt; i1)  ++i0;</div><div class="line"><a name="l00113"></a><span class="lineno">  113</span>&#160;      <span class="keywordflow">while</span> ( <a class="code" href="a02113.html#a8898075831dccdbc4a2dd72472f0e8e3">status</a>(<a class="code" href="a02241.html">VertexHandle</a>(i1)).deleted() &amp;&amp; i0 &lt; i1)  --i1;</div><div class="line"><a name="l00114"></a><span class="lineno">  114</span>&#160;      <span class="keywordflow">if</span> (i0 &gt;= i1) <span class="keywordflow">break</span>;</div><div class="line"><a name="l00115"></a><span class="lineno">  115</span>&#160;</div><div class="line"><a name="l00116"></a><span class="lineno">  116</span>&#160;      <span class="comment">// If we keep track of the vertex handles for updates,</span></div><div class="line"><a name="l00117"></a><span class="lineno">  117</span>&#160;      <span class="comment">// we need to have the opposite direction</span></div><div class="line"><a name="l00118"></a><span class="lineno">  118</span>&#160;      <span class="keywordflow">if</span> ( track_vhandles ) {</div><div class="line"><a name="l00119"></a><span class="lineno">  119</span>&#160;        vertex_inverse_map[i1] = i0;</div><div class="line"><a name="l00120"></a><span class="lineno">  120</span>&#160;        vertex_inverse_map[i0] = -1;</div><div class="line"><a name="l00121"></a><span class="lineno">  121</span>&#160;      }</div><div class="line"><a name="l00122"></a><span class="lineno">  122</span>&#160;</div><div class="line"><a name="l00123"></a><span class="lineno">  123</span>&#160;      <span class="comment">// swap</span></div><div class="line"><a name="l00124"></a><span class="lineno">  124</span>&#160;      std::swap(vertices_[i0], vertices_[i1]);</div><div class="line"><a name="l00125"></a><span class="lineno">  125</span>&#160;      std::swap(vh_map[i0],  vh_map[i1]);</div><div class="line"><a name="l00126"></a><span class="lineno">  126</span>&#160;      vprops_swap(i0, i1);</div><div class="line"><a name="l00127"></a><span class="lineno">  127</span>&#160;    };</div><div class="line"><a name="l00128"></a><span class="lineno">  128</span>&#160;</div><div class="line"><a name="l00129"></a><span class="lineno">  129</span>&#160;    vertices_.resize(<a class="code" href="a02113.html#a8898075831dccdbc4a2dd72472f0e8e3">status</a>(<a class="code" href="a02241.html">VertexHandle</a>(i0)).deleted() ? i0 : i0+1);</div><div class="line"><a name="l00130"></a><span class="lineno">  130</span>&#160;    <a class="code" href="a02133.html#ae4577ecec699960f2f8fd115ea7c588c">vprops_resize</a>(n_vertices());</div><div class="line"><a name="l00131"></a><span class="lineno">  131</span>&#160;  }</div><div class="line"><a name="l00132"></a><span class="lineno">  132</span>&#160;</div><div class="line"><a name="l00133"></a><span class="lineno">  133</span>&#160;</div><div class="line"><a name="l00134"></a><span class="lineno">  134</span>&#160;  <span class="comment">// remove deleted edges</span></div><div class="line"><a name="l00135"></a><span class="lineno">  135</span>&#160;  <span class="keywordflow">if</span> (_e &amp;&amp; n_edges() &gt; 0 &amp;&amp; this-&gt;has_edge_status() )</div><div class="line"><a name="l00136"></a><span class="lineno">  136</span>&#160;  {</div><div class="line"><a name="l00137"></a><span class="lineno">  137</span>&#160;    i0=0;  i1=nE-1;</div><div class="line"><a name="l00138"></a><span class="lineno">  138</span>&#160;</div><div class="line"><a name="l00139"></a><span class="lineno">  139</span>&#160;    <span class="keywordflow">while</span> (1)</div><div class="line"><a name="l00140"></a><span class="lineno">  140</span>&#160;    {</div><div class="line"><a name="l00141"></a><span class="lineno">  141</span>&#160;      <span class="comment">// find 1st deleted and last un-deleted</span></div><div class="line"><a name="l00142"></a><span class="lineno">  142</span>&#160;      <span class="keywordflow">while</span> (!<a class="code" href="a02113.html#a8898075831dccdbc4a2dd72472f0e8e3">status</a>(<a class="code" href="a02249.html">EdgeHandle</a>(i0)).deleted() &amp;&amp; i0 &lt; i1)  ++i0;</div><div class="line"><a name="l00143"></a><span class="lineno">  143</span>&#160;      <span class="keywordflow">while</span> ( <a class="code" href="a02113.html#a8898075831dccdbc4a2dd72472f0e8e3">status</a>(<a class="code" href="a02249.html">EdgeHandle</a>(i1)).deleted() &amp;&amp; i0 &lt; i1)  --i1;</div><div class="line"><a name="l00144"></a><span class="lineno">  144</span>&#160;      <span class="keywordflow">if</span> (i0 &gt;= i1) <span class="keywordflow">break</span>;</div><div class="line"><a name="l00145"></a><span class="lineno">  145</span>&#160;</div><div class="line"><a name="l00146"></a><span class="lineno">  146</span>&#160;      <span class="comment">// If we keep track of the vertex handles for updates,</span></div><div class="line"><a name="l00147"></a><span class="lineno">  147</span>&#160;      <span class="comment">// we need to have the opposite direction</span></div><div class="line"><a name="l00148"></a><span class="lineno">  148</span>&#160;      <span class="keywordflow">if</span> ( track_hhandles ) {</div><div class="line"><a name="l00149"></a><span class="lineno">  149</span>&#160;        halfedge_inverse_map[2*i1] = 2 * i0;</div><div class="line"><a name="l00150"></a><span class="lineno">  150</span>&#160;        halfedge_inverse_map[2*i0] = -1;</div><div class="line"><a name="l00151"></a><span class="lineno">  151</span>&#160;</div><div class="line"><a name="l00152"></a><span class="lineno">  152</span>&#160;        halfedge_inverse_map[2*i1 + 1] = 2 * i0 + 1;</div><div class="line"><a name="l00153"></a><span class="lineno">  153</span>&#160;        halfedge_inverse_map[2*i0 + 1] = -1;</div><div class="line"><a name="l00154"></a><span class="lineno">  154</span>&#160;      }</div><div class="line"><a name="l00155"></a><span class="lineno">  155</span>&#160;</div><div class="line"><a name="l00156"></a><span class="lineno">  156</span>&#160;      <span class="comment">// swap</span></div><div class="line"><a name="l00157"></a><span class="lineno">  157</span>&#160;      std::swap(edges_[i0], edges_[i1]);</div><div class="line"><a name="l00158"></a><span class="lineno">  158</span>&#160;      std::swap(hh_map[2*i0], hh_map[2*i1]);</div><div class="line"><a name="l00159"></a><span class="lineno">  159</span>&#160;      std::swap(hh_map[2*i0+1], hh_map[2*i1+1]);</div><div class="line"><a name="l00160"></a><span class="lineno">  160</span>&#160;      eprops_swap(i0, i1);</div><div class="line"><a name="l00161"></a><span class="lineno">  161</span>&#160;      hprops_swap(2*i0,   2*i1);</div><div class="line"><a name="l00162"></a><span class="lineno">  162</span>&#160;      hprops_swap(2*i0+1, 2*i1+1);</div><div class="line"><a name="l00163"></a><span class="lineno">  163</span>&#160;    };</div><div class="line"><a name="l00164"></a><span class="lineno">  164</span>&#160;</div><div class="line"><a name="l00165"></a><span class="lineno">  165</span>&#160;    edges_.resize(<a class="code" href="a02113.html#a8898075831dccdbc4a2dd72472f0e8e3">status</a>(<a class="code" href="a02249.html">EdgeHandle</a>(i0)).deleted() ? i0 : i0+1);</div><div class="line"><a name="l00166"></a><span class="lineno">  166</span>&#160;    eprops_resize(n_edges());</div><div class="line"><a name="l00167"></a><span class="lineno">  167</span>&#160;    hprops_resize(n_halfedges());</div><div class="line"><a name="l00168"></a><span class="lineno">  168</span>&#160;  }</div><div class="line"><a name="l00169"></a><span class="lineno">  169</span>&#160;</div><div class="line"><a name="l00170"></a><span class="lineno">  170</span>&#160;</div><div class="line"><a name="l00171"></a><span class="lineno">  171</span>&#160;  <span class="comment">// remove deleted faces</span></div><div class="line"><a name="l00172"></a><span class="lineno">  172</span>&#160;  <span class="keywordflow">if</span> (_f &amp;&amp; n_faces() &gt; 0 &amp;&amp; this-&gt;has_face_status() )</div><div class="line"><a name="l00173"></a><span class="lineno">  173</span>&#160;  {</div><div class="line"><a name="l00174"></a><span class="lineno">  174</span>&#160;    i0=0;  i1=nF-1;</div><div class="line"><a name="l00175"></a><span class="lineno">  175</span>&#160;</div><div class="line"><a name="l00176"></a><span class="lineno">  176</span>&#160;    <span class="keywordflow">while</span> (1)</div><div class="line"><a name="l00177"></a><span class="lineno">  177</span>&#160;    {</div><div class="line"><a name="l00178"></a><span class="lineno">  178</span>&#160;      <span class="comment">// find 1st deleted and last un-deleted</span></div><div class="line"><a name="l00179"></a><span class="lineno">  179</span>&#160;      <span class="keywordflow">while</span> (!<a class="code" href="a02113.html#a8898075831dccdbc4a2dd72472f0e8e3">status</a>(<a class="code" href="a02253.html">FaceHandle</a>(i0)).deleted() &amp;&amp; i0 &lt; i1)  ++i0;</div><div class="line"><a name="l00180"></a><span class="lineno">  180</span>&#160;      <span class="keywordflow">while</span> ( <a class="code" href="a02113.html#a8898075831dccdbc4a2dd72472f0e8e3">status</a>(<a class="code" href="a02253.html">FaceHandle</a>(i1)).deleted() &amp;&amp; i0 &lt; i1)  --i1;</div><div class="line"><a name="l00181"></a><span class="lineno">  181</span>&#160;      <span class="keywordflow">if</span> (i0 &gt;= i1) <span class="keywordflow">break</span>;</div><div class="line"><a name="l00182"></a><span class="lineno">  182</span>&#160;</div><div class="line"><a name="l00183"></a><span class="lineno">  183</span>&#160;      <span class="comment">// If we keep track of the face handles for updates,</span></div><div class="line"><a name="l00184"></a><span class="lineno">  184</span>&#160;      <span class="comment">// we need to have the opposite direction</span></div><div class="line"><a name="l00185"></a><span class="lineno">  185</span>&#160;      <span class="keywordflow">if</span> ( track_fhandles ) {</div><div class="line"><a name="l00186"></a><span class="lineno">  186</span>&#160;        face_inverse_map[i1] = i0;</div><div class="line"><a name="l00187"></a><span class="lineno">  187</span>&#160;        face_inverse_map[i0] = -1;</div><div class="line"><a name="l00188"></a><span class="lineno">  188</span>&#160;      }</div><div class="line"><a name="l00189"></a><span class="lineno">  189</span>&#160;</div><div class="line"><a name="l00190"></a><span class="lineno">  190</span>&#160;      <span class="comment">// swap</span></div><div class="line"><a name="l00191"></a><span class="lineno">  191</span>&#160;      std::swap(faces_[i0], faces_[i1]);</div><div class="line"><a name="l00192"></a><span class="lineno">  192</span>&#160;      std::swap(fh_map[i0], fh_map[i1]);</div><div class="line"><a name="l00193"></a><span class="lineno">  193</span>&#160;      fprops_swap(i0, i1);</div><div class="line"><a name="l00194"></a><span class="lineno">  194</span>&#160;    };</div><div class="line"><a name="l00195"></a><span class="lineno">  195</span>&#160;</div><div class="line"><a name="l00196"></a><span class="lineno">  196</span>&#160;    faces_.resize(<a class="code" href="a02113.html#a8898075831dccdbc4a2dd72472f0e8e3">status</a>(<a class="code" href="a02253.html">FaceHandle</a>(i0)).deleted() ? i0 : i0+1);</div><div class="line"><a name="l00197"></a><span class="lineno">  197</span>&#160;    fprops_resize(n_faces());</div><div class="line"><a name="l00198"></a><span class="lineno">  198</span>&#160;  }</div><div class="line"><a name="l00199"></a><span class="lineno">  199</span>&#160;</div><div class="line"><a name="l00200"></a><span class="lineno">  200</span>&#160;</div><div class="line"><a name="l00201"></a><span class="lineno">  201</span>&#160;  <span class="comment">// update handles of vertices</span></div><div class="line"><a name="l00202"></a><span class="lineno">  202</span>&#160;  <span class="keywordflow">if</span> (_e)</div><div class="line"><a name="l00203"></a><span class="lineno">  203</span>&#160;  {</div><div class="line"><a name="l00204"></a><span class="lineno">  204</span>&#160;    KernelVertexIter v_it(vertices_begin()), v_end(vertices_end());</div><div class="line"><a name="l00205"></a><span class="lineno">  205</span>&#160;    <a class="code" href="a02241.html">VertexHandle</a>     vh;</div><div class="line"><a name="l00206"></a><span class="lineno">  206</span>&#160;</div><div class="line"><a name="l00207"></a><span class="lineno">  207</span>&#160;    <span class="keywordflow">for</span> (; v_it!=v_end; ++v_it)</div><div class="line"><a name="l00208"></a><span class="lineno">  208</span>&#160;    {</div><div class="line"><a name="l00209"></a><span class="lineno">  209</span>&#160;      vh = handle(*v_it);</div><div class="line"><a name="l00210"></a><span class="lineno">  210</span>&#160;      <span class="keywordflow">if</span> (!is_isolated(vh))</div><div class="line"><a name="l00211"></a><span class="lineno">  211</span>&#160;      {</div><div class="line"><a name="l00212"></a><span class="lineno">  212</span>&#160;        set_halfedge_handle(vh, hh_map[halfedge_handle(vh).idx()]);</div><div class="line"><a name="l00213"></a><span class="lineno">  213</span>&#160;      }</div><div class="line"><a name="l00214"></a><span class="lineno">  214</span>&#160;    }</div><div class="line"><a name="l00215"></a><span class="lineno">  215</span>&#160;  }</div><div class="line"><a name="l00216"></a><span class="lineno">  216</span>&#160;</div><div class="line"><a name="l00217"></a><span class="lineno">  217</span>&#160;  <a class="code" href="a02245.html">HalfedgeHandle</a> hh;</div><div class="line"><a name="l00218"></a><span class="lineno">  218</span>&#160;  <span class="comment">// update handles of halfedges</span></div><div class="line"><a name="l00219"></a><span class="lineno">  219</span>&#160;  <span class="keywordflow">for</span> (KernelEdgeIter e_it(edges_begin()); e_it != edges_end(); ++e_it)</div><div class="line"><a name="l00220"></a><span class="lineno">  220</span>&#160;  {<span class="comment">//in the first pass update the (half)edges vertices</span></div><div class="line"><a name="l00221"></a><span class="lineno">  221</span>&#160;    hh = halfedge_handle(handle(*e_it), 0);</div><div class="line"><a name="l00222"></a><span class="lineno">  222</span>&#160;    set_vertex_handle(hh, vh_map[to_vertex_handle(hh).idx()]);</div><div class="line"><a name="l00223"></a><span class="lineno">  223</span>&#160;    hh = halfedge_handle(handle(*e_it), 1);</div><div class="line"><a name="l00224"></a><span class="lineno">  224</span>&#160;    set_vertex_handle(hh, vh_map[to_vertex_handle(hh).idx()]);</div><div class="line"><a name="l00225"></a><span class="lineno">  225</span>&#160;  }</div><div class="line"><a name="l00226"></a><span class="lineno">  226</span>&#160;  <span class="keywordflow">for</span> (KernelEdgeIter e_it(edges_begin()); e_it != edges_end(); ++e_it)</div><div class="line"><a name="l00227"></a><span class="lineno">  227</span>&#160;  {<span class="comment">//in the second pass update the connectivity of the (half)edges</span></div><div class="line"><a name="l00228"></a><span class="lineno">  228</span>&#160;    hh = halfedge_handle(handle(*e_it), 0);</div><div class="line"><a name="l00229"></a><span class="lineno">  229</span>&#160;    set_next_halfedge_handle(hh, hh_map[next_halfedge_handle(hh).idx()]);</div><div class="line"><a name="l00230"></a><span class="lineno">  230</span>&#160;    <span class="keywordflow">if</span> (!<a class="code" href="a02113.html#a95751cac0d1de0b8ca0cecf72be9f073">is_boundary</a>(hh))</div><div class="line"><a name="l00231"></a><span class="lineno">  231</span>&#160;    {</div><div class="line"><a name="l00232"></a><span class="lineno">  232</span>&#160;      set_face_handle(hh, fh_map[face_handle(hh).idx()]);</div><div class="line"><a name="l00233"></a><span class="lineno">  233</span>&#160;    }</div><div class="line"><a name="l00234"></a><span class="lineno">  234</span>&#160;    hh = halfedge_handle(handle(*e_it), 1);</div><div class="line"><a name="l00235"></a><span class="lineno">  235</span>&#160;    set_next_halfedge_handle(hh, hh_map[next_halfedge_handle(hh).idx()]);</div><div class="line"><a name="l00236"></a><span class="lineno">  236</span>&#160;    <span class="keywordflow">if</span> (!<a class="code" href="a02113.html#a95751cac0d1de0b8ca0cecf72be9f073">is_boundary</a>(hh))</div><div class="line"><a name="l00237"></a><span class="lineno">  237</span>&#160;    {</div><div class="line"><a name="l00238"></a><span class="lineno">  238</span>&#160;      set_face_handle(hh, fh_map[face_handle(hh).idx()]);</div><div class="line"><a name="l00239"></a><span class="lineno">  239</span>&#160;    }</div><div class="line"><a name="l00240"></a><span class="lineno">  240</span>&#160;  }</div><div class="line"><a name="l00241"></a><span class="lineno">  241</span>&#160;</div><div class="line"><a name="l00242"></a><span class="lineno">  242</span>&#160;  <span class="comment">// update handles of faces</span></div><div class="line"><a name="l00243"></a><span class="lineno">  243</span>&#160;  <span class="keywordflow">if</span> (_e)</div><div class="line"><a name="l00244"></a><span class="lineno">  244</span>&#160;  {</div><div class="line"><a name="l00245"></a><span class="lineno">  245</span>&#160;    KernelFaceIter  f_it(faces_begin()), f_end(faces_end());</div><div class="line"><a name="l00246"></a><span class="lineno">  246</span>&#160;    <a class="code" href="a02253.html">FaceHandle</a>      fh;</div><div class="line"><a name="l00247"></a><span class="lineno">  247</span>&#160;</div><div class="line"><a name="l00248"></a><span class="lineno">  248</span>&#160;    <span class="keywordflow">for</span> (; f_it!=f_end; ++f_it)</div><div class="line"><a name="l00249"></a><span class="lineno">  249</span>&#160;    {</div><div class="line"><a name="l00250"></a><span class="lineno">  250</span>&#160;      fh = handle(*f_it);</div><div class="line"><a name="l00251"></a><span class="lineno">  251</span>&#160;      set_halfedge_handle(fh, hh_map[halfedge_handle(fh).idx()]);</div><div class="line"><a name="l00252"></a><span class="lineno">  252</span>&#160;    }</div><div class="line"><a name="l00253"></a><span class="lineno">  253</span>&#160;  }</div><div class="line"><a name="l00254"></a><span class="lineno">  254</span>&#160;</div><div class="line"><a name="l00255"></a><span class="lineno">  255</span>&#160;  <span class="keyword">const</span> <span class="keywordtype">int</span> vertexCount   = int(vertices_.size());</div><div class="line"><a name="l00256"></a><span class="lineno">  256</span>&#160;  <span class="keyword">const</span> <span class="keywordtype">int</span> halfedgeCount = int(edges_.size() * 2);</div><div class="line"><a name="l00257"></a><span class="lineno">  257</span>&#160;  <span class="keyword">const</span> <span class="keywordtype">int</span> faceCount     = int(faces_.size());</div><div class="line"><a name="l00258"></a><span class="lineno">  258</span>&#160;</div><div class="line"><a name="l00259"></a><span class="lineno">  259</span>&#160;  <span class="comment">// Update the vertex handles in the vertex handle vector</span></div><div class="line"><a name="l00260"></a><span class="lineno">  260</span>&#160;  <span class="keyword">typename</span> std_API_Container_VHandlePointer::iterator v_it(vh_to_update.begin()), v_it_end(vh_to_update.end());</div><div class="line"><a name="l00261"></a><span class="lineno">  261</span>&#160;  <span class="keywordflow">for</span>(; v_it != v_it_end; ++v_it)</div><div class="line"><a name="l00262"></a><span class="lineno">  262</span>&#160;  {</div><div class="line"><a name="l00263"></a><span class="lineno">  263</span>&#160;</div><div class="line"><a name="l00264"></a><span class="lineno">  264</span>&#160;    <span class="comment">// Only changed vertices need to be considered</span></div><div class="line"><a name="l00265"></a><span class="lineno">  265</span>&#160;    <span class="keywordflow">if</span> ( (*v_it)-&gt;idx() != vh_map[(*v_it)-&gt;idx()].idx() ) {</div><div class="line"><a name="l00266"></a><span class="lineno">  266</span>&#160;      *(*v_it) = <a class="code" href="a02241.html">VertexHandle</a>(vertex_inverse_map[(*v_it)-&gt;idx()]);</div><div class="line"><a name="l00267"></a><span class="lineno">  267</span>&#160;</div><div class="line"><a name="l00268"></a><span class="lineno">  268</span>&#160;      <span class="comment">// Vertices above the vertex count have to be already mapped, or they are invalid now!</span></div><div class="line"><a name="l00269"></a><span class="lineno">  269</span>&#160;    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> ( ((*v_it)-&gt;idx() &gt;= vertexCount) &amp;&amp; (vertex_inverse_map.find((*v_it)-&gt;idx()) == vertex_inverse_map.end()) ) {</div><div class="line"><a name="l00270"></a><span class="lineno">  270</span>&#160;      (*v_it)-&gt;<a class="code" href="a02237.html#ab025c00d990cc69cd20e33e94abd2db9">invalidate</a>();</div><div class="line"><a name="l00271"></a><span class="lineno">  271</span>&#160;    }</div><div class="line"><a name="l00272"></a><span class="lineno">  272</span>&#160;</div><div class="line"><a name="l00273"></a><span class="lineno">  273</span>&#160;  }</div><div class="line"><a name="l00274"></a><span class="lineno">  274</span>&#160;</div><div class="line"><a name="l00275"></a><span class="lineno">  275</span>&#160;  <span class="comment">// Update the halfedge handles in the halfedge handle vector</span></div><div class="line"><a name="l00276"></a><span class="lineno">  276</span>&#160;  <span class="keyword">typename</span> std_API_Container_HHandlePointer::iterator hh_it(hh_to_update.begin()), hh_it_end(hh_to_update.end());</div><div class="line"><a name="l00277"></a><span class="lineno">  277</span>&#160;  <span class="keywordflow">for</span>(; hh_it != hh_it_end; ++hh_it)</div><div class="line"><a name="l00278"></a><span class="lineno">  278</span>&#160;  {</div><div class="line"><a name="l00279"></a><span class="lineno">  279</span>&#160;    <span class="comment">// Only changed faces need to be considered</span></div><div class="line"><a name="l00280"></a><span class="lineno">  280</span>&#160;    <span class="keywordflow">if</span> ( (*hh_it)-&gt;idx() != hh_map[(*hh_it)-&gt;idx()].idx() ) {</div><div class="line"><a name="l00281"></a><span class="lineno">  281</span>&#160;      *(*hh_it) = <a class="code" href="a02245.html">HalfedgeHandle</a>(halfedge_inverse_map[(*hh_it)-&gt;idx()]);</div><div class="line"><a name="l00282"></a><span class="lineno">  282</span>&#160;</div><div class="line"><a name="l00283"></a><span class="lineno">  283</span>&#160;      <span class="comment">// Vertices above the face count have to be already mapped, or they are invalid now!</span></div><div class="line"><a name="l00284"></a><span class="lineno">  284</span>&#160;    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> ( ((*hh_it)-&gt;idx() &gt;= halfedgeCount) &amp;&amp; (halfedge_inverse_map.find((*hh_it)-&gt;idx()) == halfedge_inverse_map.end()) ) {</div><div class="line"><a name="l00285"></a><span class="lineno">  285</span>&#160;      (*hh_it)-&gt;<a class="code" href="a02237.html#ab025c00d990cc69cd20e33e94abd2db9">invalidate</a>();</div><div class="line"><a name="l00286"></a><span class="lineno">  286</span>&#160;    }</div><div class="line"><a name="l00287"></a><span class="lineno">  287</span>&#160;</div><div class="line"><a name="l00288"></a><span class="lineno">  288</span>&#160;  }</div><div class="line"><a name="l00289"></a><span class="lineno">  289</span>&#160;</div><div class="line"><a name="l00290"></a><span class="lineno">  290</span>&#160;  <span class="comment">// Update the face handles in the face handle vector</span></div><div class="line"><a name="l00291"></a><span class="lineno">  291</span>&#160;  <span class="keyword">typename</span> std_API_Container_FHandlePointer::iterator fh_it(fh_to_update.begin()), fh_it_end(fh_to_update.end());</div><div class="line"><a name="l00292"></a><span class="lineno">  292</span>&#160;  <span class="keywordflow">for</span>(; fh_it != fh_it_end; ++fh_it)</div><div class="line"><a name="l00293"></a><span class="lineno">  293</span>&#160;  {</div><div class="line"><a name="l00294"></a><span class="lineno">  294</span>&#160;</div><div class="line"><a name="l00295"></a><span class="lineno">  295</span>&#160;    <span class="comment">// Only changed faces need to be considered</span></div><div class="line"><a name="l00296"></a><span class="lineno">  296</span>&#160;    <span class="keywordflow">if</span> ( (*fh_it)-&gt;idx() != fh_map[(*fh_it)-&gt;idx()].idx() ) {</div><div class="line"><a name="l00297"></a><span class="lineno">  297</span>&#160;      *(*fh_it) = <a class="code" href="a02253.html">FaceHandle</a>(face_inverse_map[(*fh_it)-&gt;idx()]);</div><div class="line"><a name="l00298"></a><span class="lineno">  298</span>&#160;</div><div class="line"><a name="l00299"></a><span class="lineno">  299</span>&#160;      <span class="comment">// Vertices above the face count have to be already mapped, or they are invalid now!</span></div><div class="line"><a name="l00300"></a><span class="lineno">  300</span>&#160;    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> ( ((*fh_it)-&gt;idx() &gt;= faceCount) &amp;&amp; (face_inverse_map.find((*fh_it)-&gt;idx()) == face_inverse_map.end()) ) {</div><div class="line"><a name="l00301"></a><span class="lineno">  301</span>&#160;      (*fh_it)-&gt;<a class="code" href="a02237.html#ab025c00d990cc69cd20e33e94abd2db9">invalidate</a>();</div><div class="line"><a name="l00302"></a><span class="lineno">  302</span>&#160;    }</div><div class="line"><a name="l00303"></a><span class="lineno">  303</span>&#160;</div><div class="line"><a name="l00304"></a><span class="lineno">  304</span>&#160;  }</div><div class="line"><a name="l00305"></a><span class="lineno">  305</span>&#160;}</div><div class="line"><a name="l00306"></a><span class="lineno">  306</span>&#160;</div><div class="line"><a name="l00307"></a><span class="lineno">  307</span>&#160;}</div><div class="line"><a name="l00308"></a><span class="lineno">  308</span>&#160;</div><div class="ttc" id="a02253_html"><div class="ttname"><a href="a02253.html">OpenMesh::FaceHandle</a></div><div class="ttdoc">Handle for a face entity. </div><div class="ttdef"><b>Definition:</b> Handles.hh:141</div></div>
<div class="ttc" id="a02113_html_aba7fd4df59227f974b44111ac45e835f"><div class="ttname"><a href="a02113.html#aba7fd4df59227f974b44111ac45e835f">OpenMesh::ArrayKernel::garbage_collection</a></div><div class="ttdeci">void garbage_collection(bool _v=true, bool _e=true, bool _f=true)</div><div class="ttdoc">garbage collection </div><div class="ttdef"><b>Definition:</b> ArrayKernel.cc:166</div></div>
<div class="ttc" id="a02237_html_ab025c00d990cc69cd20e33e94abd2db9"><div class="ttname"><a href="a02237.html#ab025c00d990cc69cd20e33e94abd2db9">OpenMesh::BaseHandle::invalidate</a></div><div class="ttdeci">void invalidate()</div><div class="ttdoc">reset handle to be invalid </div><div class="ttdef"><b>Definition:</b> Handles.hh:77</div></div>
<div class="ttc" id="a02133_html_ae4577ecec699960f2f8fd115ea7c588c"><div class="ttname"><a href="a02133.html#ae4577ecec699960f2f8fd115ea7c588c">OpenMesh::BaseKernel::vprops_resize</a></div><div class="ttdeci">void vprops_resize(size_t _n) const</div><div class="ttdoc">Resizes all vertex property vectors to the specified size. </div><div class="ttdef"><b>Definition:</b> BaseKernel.hh:703</div></div>
<div class="ttc" id="a02113_html_a8898075831dccdbc4a2dd72472f0e8e3"><div class="ttname"><a href="a02113.html#a8898075831dccdbc4a2dd72472f0e8e3">OpenMesh::ArrayKernel::status</a></div><div class="ttdeci">const StatusInfo &amp; status(VertexHandle _vh) const</div><div class="ttdoc">Status Query API. </div><div class="ttdef"><b>Definition:</b> ArrayKernel.hh:501</div></div>
<div class="ttc" id="a02241_html"><div class="ttname"><a href="a02241.html">OpenMesh::VertexHandle</a></div><div class="ttdoc">Handle for a vertex entity. </div><div class="ttdef"><b>Definition:</b> Handles.hh:120</div></div>
<div class="ttc" id="a02113_html_a95751cac0d1de0b8ca0cecf72be9f073"><div class="ttname"><a href="a02113.html#a95751cac0d1de0b8ca0cecf72be9f073">OpenMesh::ArrayKernel::is_boundary</a></div><div class="ttdeci">bool is_boundary(HalfedgeHandle _heh) const</div><div class="ttdoc">Is halfedge _heh a boundary halfedge (is its face handle invalid) ? </div><div class="ttdef"><b>Definition:</b> ArrayKernel.hh:398</div></div>
<div class="ttc" id="a02249_html"><div class="ttname"><a href="a02249.html">OpenMesh::EdgeHandle</a></div><div class="ttdoc">Handle for a edge entity. </div><div class="ttdef"><b>Definition:</b> Handles.hh:134</div></div>
<div class="ttc" id="a01233_html"><div class="ttname"><a href="a01233.html">OpenMesh</a></div><div class="ttdoc">Contains all the mesh ingredients like the polygonal mesh, the triangle mesh, different mesh kernels ...</div><div class="ttdef"><b>Definition:</b> MeshItems.hh:59</div></div>
<div class="ttc" id="a02245_html"><div class="ttname"><a href="a02245.html">OpenMesh::HalfedgeHandle</a></div><div class="ttdoc">Handle for a halfedge entity. </div><div class="ttdef"><b>Definition:</b> Handles.hh:127</div></div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
<hr>
<address>
<small>
<a href="http://www.rwth-graphics.de" style="text-decoration:none;">
</a>
Project <b>OpenMesh</b>, 
&copy;&nbsp; Computer Graphics Group, RWTH Aachen.
Documentation generated using 
<a class="el" href="http://www.doxygen.org/index.html">
<b>doxygen</b>
</a>.
</small>
</address>
</body>
</html>
